翻訳と辞書 Words near each other ・ Hill Building ・ Hill Carrow ・ Hill castle ・ Hill Cemetery and Parson Hubbard House Historic District ・ Hill censer ・ Hill Center Church ・ Hill cipher ・ Hill City ・ Hill City Municipal Airport ・ Hill City Township, Graham County, Kansas ・ Hill City, Idaho ・ Hill City, Kansas ・ Hill City, Minnesota ・ Hill City, South Dakota ・ Hill Climb Racing (video game) ・ Hill climbing ・ Hill Close Gardens, Warwick ・ Hill Club ・ Hill College ・ Hill college ・ Hill committee ・ Hill Comnor ・ Hill Complex Historic District ・ Hill Cottage (Saranac Lake, New York) ・ Hill country blues ・ Hill Country Christian School ・ Hill Country Film Festival ・ Hill Country homes ・ Hill Country State Natural Area ・ Hill Country Transit District Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Hill climbing ： ウィキペディア英語版 Hill climbing In computer science, hill climbing is a mathematical optimization technique which belongs to the family of local search. It is an iterative algorithm that starts with an arbitrary solution to a problem, then attempts to find a better solution by incrementally changing a single element of the solution. If the change produces a better solution, an incremental change is made to the new solution, repeating until no further improvements can be found. For example, hill climbing can be applied to the travelling salesman problem. It is easy to find an initial solution that visits all the cities but will be very poor compared to the optimal solution. The algorithm starts with such a solution and makes small improvements to it, such as switching the order in which two cities are visited. Eventually, a much shorter route is likely to be obtained. Hill climbing is good for finding a local optimum (a solution that cannot be improved by considering a neighbouring configuration) but it is not necessarily guaranteed to find the best possible solution (the global optimum) out of all possible solutions (the search space). In convex problems, hill-climbing ''is'' optimal. Examples of algorithms that solve convex problems by hill-climbing include the simplex algorithm for linear programming and binary search. The characteristic that only local optima are guaranteed can be cured by using restarts (repeated local search), or more complex schemes based on iterations, like iterated local search, on memory, like reactive search optimization and tabu search, or memory-less stochastic modifications, like simulated annealing. The relative simplicity of the algorithm makes it a popular first choice amongst optimizing algorithms. It is used widely in artificial intelligence, for reaching a goal state from a starting node. Choice of next node and starting node can be varied to give a list of related algorithms. Although more advanced algorithms such as simulated annealing or tabu search may give better results, in some situations hill climbing works just as well. Hill climbing can often produce a better result than other algorithms when the amount of time available to perform a search is limited, such as with real-time systems. It is an anytime algorithm: it can return a valid solution even if it's interrupted at any time before it ends. ==Mathematical description== Hill climbing attempts to maximize (or minimize) a target function $f(\backslash mathbf)$, where $\backslash mathbf$ is a vector of continuous and/or discrete values. At each iteration, hill climbing will adjust a single element in $\backslash mathbf$ and determine whether the change improves the value of $f(\backslash mathbf)$. (Note that this differs from gradient descent methods, which adjust all of the values in $\backslash mathbf$ at each iteration according to the gradient of the hill.) With hill climbing, any change that improves $f(\backslash mathbf)$ is accepted, and the process continues until no change can be found to improve the value of $f(\backslash mathbf)$. Then $\backslash mathbf$ is said to be "locally optimal". In discrete vector spaces, each possible value for $\backslash mathbf$ may be visualized as a vertex in a graph. Hill climbing will follow the graph from vertex to vertex, always locally increasing (or decreasing) the value of $f(\backslash mathbf)$, until a local maximum (or local minimum) $x\_m$ is reached. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Hill climbing」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.